import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        //Scanner in = new Scanner(System.in);
        //int a = in.nextInt();
        //System.out.println(a);
        int [] nums = {2,3,5,1,4};
        quickSort(nums, 0, nums.length -1 );
        for(int i : nums){
            System.out.print(i);
        }
        System.out.println("Hello World!");
    }
    
    public static void quickSort(int[] nums, int from, int to){
    	if(from < to){
    		int index = findPosition(nums, from, to);
            quickSort(nums, from, index - 1);
            quickSort(nums, index + 1, to);
    	}
        
    }
    public static int findPosition(int[] nums, int from, int to){
        int value = nums[from];
        while(from < to){
            while(nums[to] >= value && to > from){
                to--;
            }
            swap(nums, from, to);
            while(nums[from] < value && from < to){
                from ++;
            }
            swap(nums, from, to);
        }
        return from;
    }
    
    public static void swap(int nums[], int from, int to){
        int tmp = nums[from];
        nums[from] = nums[to];
        nums[to] = tmp;
    }
}